Few-cosine spherical codes and Barnes-Wall lattices

نویسنده

  • Robert L. Griess
چکیده

Using Barnes-Wall lattices and 1-cocycles on finite groups of monomial matrices, we give a procedure to construct tricosine spherical codes. This was inspired by a 14-dimensional code which Ballinger, Cohn, Giansiracusa and Morris discovered in studies of the universally optimal property. It has 64 vectors and cosines −37 ,− 1 7 , 1 7 . We construct the Optimism Code, a 4-cosine spherical code with 256 unit vectors in 16-dimensions. The cosines are 0,±14 ,−1. Its automorphism group has shape 21+8·GL(4, 2). The Optimism Code contains a subcode related to the BCGM code. The Optimism Code implies existence of a nonlinear binary code with parameters (16, 256, 6), a Nordstrom-Robinson code, and gives a context for determining its automorphism group, which has form 2:Alt7.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Certain Lattice Neighboring from Barnes-wall Lattice and Some Laminated Lattices

We give classifications of integral lattices which include the Barnes-Wall lattice BW16 or laminated lattices of dimension 1 6 d 6 8 and of minimum 4. Also, we give certain lattice neighboring from each lattice. Furthermore, we study spherical designs and the other properties.

متن کامل

Certain Lattice Neighboring from Barnes-wall Lattice and Laminated Lattices

We give classifications of integral lattices which include the Barnes-Wall lattice BW16 or laminated lattices of dimension 1 6 d 6 8 and of minimum 4. Also, we give certain lattice neighboring from each lattice. Furthermore, we study spherical designs and the other properties.

متن کامل

Rigidity of spherical codes

A packing of spherical caps on the surface of a sphere (that is, a spherical code) is called rigid or jammed if it is isolated within the space of packings. In other words, aside from applying a global isometry, the packing cannot be deformed. In this paper, we systematically study the rigidity of spherical codes, particularly kissing configurations. One surprise is that the kissing configurati...

متن کامل

Spherical Designs and Zeta Functions of Lattices

We set up a connection between the theory of spherical designs and the question of minima of Epstein’s zeta function. More precisely, we prove that a Euclidean lattice, all layers of which hold a 4-design, achieves a local minimum of the Epstein’s zeta function, at least at any real s > n 2 . We deduce from this a new proof of Sarnak and Strömbergsson’s theorem asserting that the root lattices ...

متن کامل

N ov 2 00 6 SPHERICAL DESIGNS AND ZETA FUNCTIONS OF LATTICES

We set up a connection between the theory of spherical designs and the question of minima of Epstein’s zeta function. More precisely, we prove that a Euclidean lattice, all layers of which hold a 4-design, achieves a local minimum of the Epstein’s zeta function, at least at any real s > n 2 . We deduce from this a new proof of Sarnak and Strömbergsson’s theorem asserting that the root lattices ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 115  شماره 

صفحات  -

تاریخ انتشار 2008